Preprocessing for controlled query evaluation in complete first-order databases
نویسنده
چکیده
i
منابع مشابه
Non-zero probability of nearest neighbor searching
Nearest Neighbor (NN) searching is a challenging problem in data management and has been widely studied in data mining, pattern recognition and computational geometry. The goal of NN searching is efficiently reporting the nearest data to a given object as a query. In most of the studies both the data and query are assumed to be precise, however, due to the real applications of NN searching, suc...
متن کاملPreprocessing for controlled query evaluation with availability policy
Controlled Query Evaluation (CQE) defines a logical framework to protect confidential information in a database. By modeling a user’s a priori knowledge appropriately, a CQE system not only controls access to certain database entries but also accounts for information inferred by the user. In this article, we present a static (preprocessing) CQE-approach for propositional databases with an avail...
متن کاملFirst-Order Query Evaluation with Cardinality Conditions
We study an extension of first-order logic that allows to express cardinality conditions in a similar way as SQL’s COUNT operator. The corresponding logic FOC(P) was introduced by Kuske and Schweikardt [16], who showed that query evaluation for this logic is fixedparameter tractable on classes of databases of bounded degree. In the present paper, we first show that the fixed-parameter tractabil...
متن کاملOn Finding an Inference-Proof Complete Database for Controlled Query Evaluation
Controlled Query Evaluation (CQE) offers a logical framework to prevent a user of a database from inadvertently gaining knowledge he is not allowed to know. By modeling the user’s a priori knowledge in an appropriate way, a CQE system can control not only plain access to database entries but also inferences made by the user. A dynamic CQE system that enforces inference control at runtime has al...
متن کاملNormalization and Compilation of Deductive and Object-Oriented Databases Programs for Efficient Query Evaluation
A normalization process is proposed to serve not only as a preprocessing stage for compilation and evaluation but also as a tool for classifying recursions. Then the query-independent compilation and chain-based evaluation method can be extended naturally to process a class of DOOD programs and queries. The query-independent compilation captures the bindings that could be diicult to be captured...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009